Complete symmetry in d2l systems and cellular automata
نویسندگان
چکیده
منابع مشابه
Complete Symmetry in D2L Systems and Cellular Automata*
We introduce completely symmetric D2L systems and cellular automata by means of an additional restriction on the corresponding classes of symmetric devices. Then we show that completely symmetric D2L systems and cellular automata are still able to simulate Turing machine computations. As corollaries we obtain new characterizations of the recursively enumerable languages and of some space-bounde...
متن کاملNP-Complete Problems in Cellular Automata
An example of a cellular automat on (CA) is given in which the following problems are NP -complete: (i) determining if a given subconfigurati cn s can be gener ated af ter [s] t ime steps, (ii) determining if a given eubccnfigurat ion 8 will rec ur afte r lsi t ime steps, (iii) determining if a given te mporal sequence of state s 8 can be generated in lsi time steps. It is also found that the C...
متن کاملExploring and Exploiting Quantum-Dot Cellular Automata
The Full Adders (FAs) constitute the essential elements of digital systems, in a sense that they affect the circuit parameters of such systems. With respect to the MOSFET restrictions, its replacement by new devices and technologies is inevitable. QCA is one of the accomplishments in nanotechnology nominated as the candidate for MOSFET replacement. In this article 4 new layouts are presente...
متن کاملSymmetry pattern transition in cellular automata with complex behavior
A transition from asymmetric to symmetric patterns in time-dependent extended systems is described. It is found that one dimensional cellular automata, started from fully random initial conditions, can be forced to evolve into complex symmetrical patterns by stochastically coupling a proportion p of pairs of sites located at equal distance from the center of the lattice. A nontrivial critical v...
متن کاملSymmetry and Entropy of One-Dimensional Legal Cellular Automata
The one-dimensional legal cellular automata (CAs) used in Wolfram’s original classification from a viewpoint of symmetropy (an object related to symmetry and entropy) are quantified. For this quantification, the discrete Walsh analysis that expresses the two-dimensional discrete pattern in terms of the four types of symmetry is used. The following was found. (1) The relationship between symmetr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Mathematics
سال: 1986
ISSN: 0020-7160,1029-0265
DOI: 10.1080/00207168608803517